Self-Stabilizing Self-Assembly

نویسندگان

چکیده

The emerging field of passive macro-scale tile-based self-assembly (TBSA) shows promise in enabling effective manufacturing processes by harnessing TBSA's intrinsic parallelism. However, current TBSA methodologies still do not fulfill their potentials, largely because such assemblies are often prone to errors, and the size an individual assembly is limited due insufficient mechanical stability. Moreover, instability issue worsens as grow size. Using a novel type magnetically-bonded tiles carried bristle-bot drives, we propose here framework that reverses this tendency; i.e., grows, it becomes more stable. Stability achieved introducing two sets move opposite directions, thus zeroing net force. physics-based computational experiments, compare performance proposed approach with common orbital shaking method, proving system indeed possesses self-stabilizing characteristics. Our enables containing hundreds be built, while inherently few tens tiles. results indicate one primary limitations mechanical, agitation-based approaches, instability, might overcome employing swarm free-running, sensorless mobile robots, herein represented at macroscopic scale.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-stabilizing Deterministic Gathering

In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a determini...

متن کامل

Self-Stabilizing Paxos

We present the first self-stabilizing consensus and replicated state machine for asynchronousmessage passing systems. The scheme does not require that all participants make a certain numberof steps prior to reaching a practically infinite execution where the replicated state machine exhibitsthe desired behavior. In other words, the system reaches a configuration from which it operat...

متن کامل

Self-stabilizing Virtual Synchrony

Virtual synchrony (VS) is an important abstraction that is proven to be extremely useful when implemented over asynchronous, typically large, message-passing distributed systems. Fault tolerant design is critical for the success of such implementations since large distributed systems can be highly available as long as they do not depend on the full operational status of every system participant...

متن کامل

Self-stabilizing Determinsitic Gathering

In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a determini...

متن کامل

Self-stabilizing universal algorithms

We prove the existence of a “universal” self-stabilizing algorithm, i.e., an algorithm which allows to stabilize a distributed system to a desired behaviour (as long as an algorithm stabilizing to that behaviour exists). Previous proposals required drastic increases in asymmetry and knowledge in order to work, while our algorithm does not use any additional knowledge, and does not require more ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics & automation letters

سال: 2022

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2022.3191795